ON THE FENG-RAO BOUND FOR THE MINIMUM DISTANCE OF CERTAIN ALGEBRAIC GEOMETRY CODES
نویسندگان
چکیده
منابع مشابه
On the Feng-Rao Bound for the L-construction of Algebraic Geometry Codes
which is called the L-construction, was not explicitly mentioned by Goppa but known to researchers including Goppa and Manin [17, p.386]. CL(D,mQ) seems to be first explicitly defined in [8], [15]. Most research articles treat only CΩ(D,mQ). A reason for this trend may be due to the lack of efficient decoding algorithms for CL(D,mQ), while we know efficient decoding algorithms for CΩ(D,mQ) prop...
متن کاملOn the second Feng-Rao distance of Algebraic Geometry codes related to Arf semigroups
We describe the second (generalized) Feng-Rao distance for elements in an Arf numerical semigroup that are greater than or equal to the conductor of the semigroup. This provides a lower bound for the second Hamming weight for one point AG codes. In particular, we can obtain the second Feng-Rao distance for the codes defined by asymptotically good towers of function fields whose Weierstrass semi...
متن کاملFurther improvements on the Feng-Rao bound for dual codes
Salazar, Dunn and Graham in [15] presented an improved Feng-Rao bound for the minimum distance of dual codes. In this work we take the improvement a step further. Both the original bound by Salazar et. al., as well as our improvement are lifted so that they deal with generalized Hamming weights. We also demonstrate the advantage of working with one-way well-behaving pairs rather than weakly wel...
متن کاملAn improvement of the Feng-Rao bound for primary codes
We present a new bound for the minimum distance of a general primary linear code. For affine variety codes defined from generalised Cab polynomials the new bound often improves dramatically on the Feng-Rao bound for primary codes [1, 10]. The method does not only work for the minimum distance but can be applied to any generalised Hamming weight.
متن کاملGeneralized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
E FFICIENT decoding of BCHand Reed-Solomon codes can be done by using the Berlekamp-Massey algorithm [ 11, and it is natural to try to use the extension to N dimensions of Sakata [2] to decode algebraic-geometric codes. For codes from regular plane curves this was done in [3] and using the Feng-Rao majority scheme from [4], the procedure was extended in [S] and [6]. For a class of space curves ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kyushu Journal of Mathematics
سال: 2002
ISSN: 1340-6116
DOI: 10.2206/kyushujm.56.405